TTLA: two-way trust between clients and fog servers using Bayesian learning automata
نویسندگان
چکیده
Fog computing is a promising paradigm for use as an efficient architecture Internet-of-Things applications. This architecture’s advantages include proximity, low latency, adaptable resource capacity, and distributed structure. A considerable amount of generated data their requisites to real-time processes cause fog nodes offload the number tasks others, causing trust issues. In this paper, each client prefers task trusted server, server serve clients. may take some time, especially if we wish reduce energy consumption. paper proposes Bayesian learning automaton-based two-way management strategy address issue. The proposed method outperforms current state-of-the-art methods regarding consumption, network usage, response value.
منابع مشابه
the relationship between using language learning strategies, learners’ optimism, educational status, duration of learning and demotivation
with the growth of more humanistic approaches towards teaching foreign languages, more emphasis has been put on learners’ feelings, emotions and individual differences. one of the issues in teaching and learning english as a foreign language is demotivation. the purpose of this study was to investigate the relationship between the components of language learning strategies, optimism, duration o...
15 صفحه اولCooperative Transaction Processing between Clients and Servers
Business rules are often implemented as stored procedures in a database server. These procedures are triggered by various clients, but the execution load is fully centralized on the server. We improve the overall response time and increase server throughput by balancing this load between the server and the clients. In our novel scheme, parts of the stored procedures are executed on cached data ...
متن کاملTwo-Way Two-Tape Automata
In this article we consider two-way two-tape (alternating) automata accepting pairs of words and we study some closure properties of this model. Our main result is that such alternating automata are not closed under complementation for non-unary alphabets. This improves a similar result of Kari and Moore for picture languages. We also show that these deterministic, non-deterministic and alterna...
متن کاملTropical Two-Way Automata
In this paper we study two-way min-plus automata. We prove that two-way distance automata are equivalent to one-way distance automata. In the second part of the paper we show that, with general min-plus semirings, it is decidable whether every accepted word has a weight different from −∞ and that, in contrast, it is undecidable whether there exists a word accepted with a weight different from −∞.
متن کاملThe Reduction of Two-Way Automata to One-Way Automata
We describe a new elementary reduction of two-way automata to one-way automata. The reduction is based on the subset construction rather than on crossing sequence analysis.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Journal of Supercomputing
سال: 2023
ISSN: ['0920-8542', '1573-0484']
DOI: https://doi.org/10.1007/s11227-023-05264-6